Sorting Integers on the AP1000
نویسندگان
چکیده
Sorting is one of the classic problems of computer science. Whilst well understood on sequential machines, the diversity of architectures amongst parallel systems means that algorithms do not perform uniformly on all platforms. This document describes the implementation of an radix based algorithm for sorting positive integers on a Fujitsu AP1000 Supercomputer, which was constructed as an entry in the Joint Symposium on Parallel Processing (JSPP) 1994 Parallel Software Contest (PSC94). Brief consideration is also given to a full radix sort conducted in parallel across the machine.
منابع مشابه
PADDY's Progress (Further Experiments In Free-Text Retrieval On The AP1000)
PADDY is an experimental free-text retrieval engine for the Fujitsu AP1000. Considerable development of PADDY has occurred since the work reported at the second CAP Workshop. Search patterns now include generalised regular expressions, set operations may now be applied to the results of searches, and proximity operators have been implemented. The speed of literal searches has been increased and...
متن کاملAn Implementation of a General-purpose Parallel Sorting Algorithm
A parallel sorting algorithm is presented for general purpose internal sorting on MIMD machines. The algorithm initially sorts the elements within each node using a serial sorting algorithm, then proceeds with a two phase parallel merge. The algorithm is comparison-based and requires additional storage of order the square root of the number of elements in each node. Performance of the algorithm...
متن کاملE cient Implementation of Sorting Algorithms on Asynchronous Distributed-Memory Machines
The problem of merging two sequences of elements which are stored separately in two processing elements (PEs) occurs in the implementation of many existing sorting algorithms. We describe e cient algorithms for the merging problem on asynchronous distributed-memory machines. The algorithms reduce the cost of the merge operation and of communication, as well as partly solving the problem of load...
متن کاملEecient Implementation of Sorting Algorithms on Asynchronous Distributed-memory Machines
The problem of merging two sequences of elements which are stored separately in two processing elements (PEs) occurs in the implementation of many existing sorting algorithms. We describe eecient algorithms for the merging problem on asynchronous distributed-memory machines. The algorithms reduce the cost of the merge operation and of communication, as well as partly solving the problem of load...
متن کاملA Fast, Storage-E cient Parallel Sorting Algorithm
A parallel sorting algorithm is presented for storage-e cient internal sorting on MIMD machines. The algorithm rst sorts the elements within each node using a serial sorting algorithm, then uses a two-phase parallel merge. The algorithm is comparisonbased and requires additional storage of order the square root of the number of elements in each node. Performance of the algorithm on two general-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره cs.DC/0004013 شماره
صفحات -
تاریخ انتشار 1994